#include <bits/stdc++.h>
using namespace std;

#define int int64_t
#define endl "\n"

using PII = pair<int, int>;
using TII = tuple<int, int, int>;
template<class T> using V = vector<T>;
using i64 = long long;
using i128 = __int128;
using u64 = unsigned long long;

#define FOR(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define FOR2(i, a, b, c) for (int i = (int)(a); i <= (int)(b); i += c)
#define FORD(i, b, a) for (int i = (int)(a); i >= (int)(b); i--)
#define FORD2(i, b, a, c) for (int i = (int)(a); i >= (int)(b); i -= c)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define lowbit(x) ((x) & (-x))
#define RE return;
#define Yes cout << "Yes" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define NO cout << "NO" << endl;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define sz(x) (int)(x).size()

void solve() {
    int n, m;
    cin >> n >> m;

    V<array<int, 2>> w(m + 1);

    FOR(i, 1, m) cin >> w[i][0] >> w[i][1];

    int q;
    cin >> q;

    V<int> c(q + 1, 0);

    FOR(i, 1, q) cin >> c[i];

    int l = 0, r = q + 1;

    function<int(int)> check = [&](int x) {
        V<int> s(n + 1, 0);
        V<int> t(n + 1, 0);
        FOR(i, 1, x) {
            t[c[i]] = 1;
        }

        FOR(i, 1, n) s[i] = s[i - 1] + t[i];

        FOR(i, 1, m) {
            int len = w[i][1] - w[i][0] + 1;
            int c1 = (s[w[i][1]] - s[w[i][0] - 1]);
            if (c1 > (len - c1)) {
                return 1;
            }
        }
        return 0;
    };

    while (l + 1 != r) {
        int mid = (l + r) >> 1;
        if (check(mid))
            r = mid;
        else
            l = mid;
    }

    if (r == q + 1) r = -1;

    cout << r << endl;
}

signed main() {
    int Task = 1;

    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> Task;
    while (Task--) {
        solve();
    }

    return 0;
}
